Programming Research Group a Probabilistic Temporal Calculus Based on Expectations a Probabilistic Temporal Calculus Based on Expectations
نویسنده
چکیده
Generalising Boolean-valued predicates to expectations | functions from the state space into 0; 1] | allows the deenition of probabilistic temporal operators that treat explicit probabilities as well as demonic nondeterminism and divergence. The conventional operational interpretation of the temporal operators does not generalise so easily: although one may speak of \satisfying a predi-cate" in the standard case, it is not meaningful to \satisfy an expectation". That diiculty is avoided by giving the operational interpretation of the operators for the probabilistic case in terms of various kinds of gambling game.
منابع مشابه
A Probabilistic Temporal Calculus Based on Expectations
Generalising Boolean valued predicates to expectations functions from the state space into allows the de nition of probabilistic temporal operators that treat explicit probabilities as well as demonic nondeterminism and divergence The conventional operational interpretation of the temporal operators does not generalise so easily although one may speak of satisfying a predi cate in the standard ...
متن کاملReasoning about efficiency within a probabilistic µ-calculus
Expectation-based probabilistic predicate transformers 15] provide a logic for probabilistic sequential programs, giving access to expressions such as`the probability that predicate A is achieved nally'. Using expectations more generally however, we can express-calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based-calculus such eeciency measu...
متن کاملAn Expectation - Transformer Model Forprobabilistic Temporal
We reinterpret the modal-calculus 16] to act over expectations rather than predicates, where expectations generalise predicates by taking states into the interval 0; 1] rather than the two-point set f0; 1g; our interest is in the idioms of the-calculus that correspond to operators of temporal logic, in particular in establishing reasoning principles for them. Our model includes both probabilist...
متن کاملProbabilistic Temporal Logics via the Modal Mu-Calculus
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm for determining whether or not states in finite-state RPLTSs satisfy formulas in the logic. The logic is based on the distinction between (probabilistic) “systems” and (nonprobabilistic) “observations”: using the modal...
متن کاملProbabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC ) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem for the system of probabilistic ITL with respect to an abstract semantics and a relative completeness theorem for the system of probabilistic DC with respect ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997